#include<stack>
#include<list>
#include<iostream>
#include<algorithm>
#include<queue>
#include<hash_set>
#include<cstring>
using namespace std;

int main()
{
    stack<int,list<int> > istack;

    istack.push(1);
    istack.size();
    istack.pop();
    istack.top();

    queue<int,list<int> > iqueue;
    iqueue.push(1);
    iqueue.size();
    iqueue.front();
    iqueue.back();
    iqueue.pop();

    priority_queue<int> ipq;
    ipq.size();
    ipq.top();
    ipq.pop();
    ipq.push(1);

    hash_set<const char*, hash<const char*>, eqstr> Set;
    Set.insert("kiwi");
    Set.insert("plum");
    Set.insert("apple");
    Set.insert("mango");
    Set.insert("apricot");
    Set.insert("banana");

    lookup(Set, "mango");
    lookup(Set, "apple");
    lookup(Set, "durian");
}
